A General Linear Least Squares SDOF Algorithm for Identifying Eigenvalues and Residues
نویسندگان
چکیده
Large damping levels, low signal to noise ratio, and low frequency resolution can cause difficulties for current SDOF SISO algorithms that identify natural frequency, modal damping ratio, and the residue associated with each eigenvalue. This paper offers an alternative technique that through a change of variables leads to a set of linear equations for the complex eigenvalue and residue. The approach resembles the least-squares procedure described by Phillips and Allemang [Proc. 14th International Modal Analysis Conference, 1996], but it avoids the approximation that the complex conjugate residue is unimportant. For noise-free data, the procedure yields the exact parameters from FRF values at any two frequencies. Noisy data is readily addressed by implementing linear least-squares. The paper uses synthetic FRF data contaminated by 20% white-noise to assess the performance via Monte Carlo simulation. Mean values and standard deviations of the eigenvalue and residue are computed for several sampling rates. An effective criterion for selecting data points to be between the quarterpower points of a resonance peak is demonstrated to be a good criterion in each case.
منابع مشابه
Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملNew Convergence Results for Least Squares Identification Algorithm, Report no. LiTH-ISY-R-2904
The basic least squares method for identifying linear systems has been extensively studied. Conditions for convergence involve issues about noise assumptions and behavior of the sample covariance matrix of the regressors. Lai and Wei proved in 1982 convergence for essentially minimal conditions on the regression matrix: All eigenvalues must tend to in nity, and the logarithm of the largest eige...
متن کاملNew Convergence Results for the Least Squares Identification Algorithm
Abstract: The basic least squares method for identifying linear systems has been extensively studied. Conditions for convergence involve issues about noise assumptions and behavior of the sample covariance matrix of the regressors. Lai and Wei proved in 1982 convergence for essentially minimal conditions on the regression matrix: All eigenvalues must tend to infinity, and the logarithm of the l...
متن کاملPositive solution of non-square fully Fuzzy linear system of equation in general form using least square method
In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...
متن کاملSolution of Systems of Linear Equations by Minimized Iterations
In an earlier publication [14] a method was described which generated the eigenvalues and eigenvectors of a matrix by a successive algorithm based on minimizations by least squares. The advantage of this method consists in the fact that the successive iterations are constantly employed with maximum efficiency which guarantees fastest convergence for a given number of iterations. Moreover, with ...
متن کامل